Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
نویسندگان
چکیده
منابع مشابه
Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملNew Valid Inequalities for the Multi- Vehicle Routing Problem with Stochastic Demands
This paper describes an exact algorithm for a variant of the vehicle routing problem in which customer demands are stochastic. Demands are revealed upon arrival at customer locations. As a result, a vehicle may reach a customer and not have sufficient capacity to collect the realized demand. Such a situation is referred to as a failure. In this paper the following recourse action is then applie...
متن کاملHybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
This article analyzes the performance of metaheuristics on the vehicle routing problem with stochastic demands (VRPSD). The problem is known to have a computational demanding objective function, which could turn to be infeasible when large instances are considered. Fast approximations of the objective function are therefore appealing because they would allow for an extended exploration of the s...
متن کاملMetaheuristics for the Vehicle Routing Problem with Stochastic Demands
X. Yao et al (Eds.): PPSN VIII, LNCS 3242, pp. 450–460, 2004. c © Springer-Verlag Berlin Heidelberg 2004 Abstract. In the vehicle routing problem with stochastic demands a vehicle has to serve a set of customers whose exact demand is known only upon arrival at the customer’s location. The objective is to find a permutation of the customers (an a priori tour) that minimizes the expected distance...
متن کاملApplications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
In the vehicle routing problem with stochastic demands a vehicle has to serve a set of customers whose exact demand is known only upon arrival at the customer’s location. The objective is to find a permutation of the customers (an a priori tour) that minimizes the expected distance traveled by the vehicle. Since the objective function is computationally demanding, effective approximations of it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.05.040